Explicitly quasiconvex optimization problems
نویسندگان
چکیده
We present some properties of explicitly quasiconvex functions, which play an important role in both multicriteria and scalar optimization. Some of these results were recently obtained together with Ovidiu Bagdasar during a research visit at the University of Derby (UK), within the project
منابع مشابه
Extremal properties of generalized convex vector-valued functions
It is known that any local maximizer of an explicitly quasiconvex realvalued function is actually a global minimizer, whenever it belongs to the intrinsic core of the function’s domain. We show that a similar property holds for componentwise explicitly quasiconvex vector-valued functions, with respect to the optimality concepts of ideal, strong and weak efficiency. These new results are applied...
متن کاملA Surrogate Dual Algorithm for Quasiconvex Quadratic Problems Abdessamad Amir and Adnan Yassine
The purpose of this paper is to solve, via a surrogate dual method, a quadratic program where the objectif function is not explicitly given. We apply our study to quasiconvex quadratic programs.
متن کاملProximal Point Methods for Quasiconvex and Convex Functions With Bregman Distances on Hadamard Manifolds
This paper generalizes the proximal point method using Bregman distances to solve convex and quasiconvex optimization problems on noncompact Hadamard manifolds. We will proved that the sequence generated by our method is well defined and converges to an optimal solution of the problem. Also, we obtain the same convergence properties for the classical proximal method, applied to a class of quasi...
متن کاملThe inexact projected gradient method for quasiconvex vector optimization problems
Vector optimization problems are a generalization of multiobjective optimization in which the preference order is related to an arbitrary closed and convex cone, rather than the nonnegative octant. Due to its real life applications, it is important to have practical solution approaches for computing. In this work, we consider the inexact projected gradient-like method for solving smooth constra...
متن کاملBounded lower subdifferentiability optimization techniques: applications
In this article we develop a global optimization algorithm for quasiconvex programming where the objective function is a Lipschitz function which may have “flat parts”. We adapt the Extended Cutting Angle method to quasiconvex functions, which reduces significantly the number of iterations and objective function evaluations, and consequently the total computing time. Applications of such an alg...
متن کامل